Vertex Equitable Labeling of Cyclic Snakes and Bistar Graphs
نویسندگان
چکیده
منابع مشابه
Vertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملvertex equitable labeling of double alternate snake graphs
let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...
متن کاملEquitable vertex arboricity of graphs
An equitable (t, k, d)-tree-coloring of a graph G is a coloring to vertices of G such that the sizes of any two color classes differ by at most one and the subgraph induced by each color class is a forest of maximum degree at most k and diameter at most d. The minimum t such that G has an equitable (t′, k, d)-tree-coloring for every t′ ≥ t is called the strong equitable (k, d)-vertex-arboricity...
متن کاملVertex BIMAGIC Total Labeling for BISTAR Bn,n
A vertex bimagic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers 1, 2, 3, ...v + e with the property that the sum of the label on the vertex and the labels of its incident edges is one of the constants k1 or k2, independent of the choice of the vertex. In this paper we have discussed that bistar Bn,n are vertex bimagic to...
متن کاملSome Results on Vertex Equitable Labeling
Let G be a graph with p vertices and q edges and let = 0,1, 2, , . 2 q A A vertex labeling : f V G A i e a vertex equitable labeling of G if it induces an edge labeling s said to b given by * = f uv f u f v * f such that 1 v a v b and * = 1,2,3, , f f f E q , where f v a is the ber of verti num ces v with = f v a for . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Research
سال: 2013
ISSN: 2070-0245,2070-0237
DOI: 10.3329/jsr.v6i1.15044